Algorithmic Congestion Optimization
نویسندگان
چکیده
Nowadays, many cities or urban areas, say San Francisco Bay Area, started to converge into a divided “working area” “living area” layout, where people commute daily to working area on mornings and commute back on nights. The commute usually depend on few vital highways. For example, the ”working area” could be San Francisco inner city, and living area could be east bay or south bay, and the vital highway could be US 101 or I-80. For working people in this arrangement, when go to work becomes a daily decision. We may arrive at work exactly at 9:30 am as the work starts, but spend an hour in the commute; or beat the traffic by leaving earlier but arriving much earlier (because the commute time is shorter), or beat the traffic by leaving later and arriving a little later. How we make those decision usually depend on 3 factors:
منابع مشابه
Congestion Control in Wireless Sensor Networks Based on Bioluminescent Firefly Behavior
Congestion in Wireless Sensor Network (WSN) is an issue of concern for several researchers in recent years. The key challenge is to develop an algorithmic rule which may realize the optimased route on the idea of parameters like residual energy, range of retransmissions and the distance between source and destination. The Firefly Algorithmic rule is implemented in this paper that relies on the ...
متن کاملUrban road network crisis response management: time-sensitive decision optimization
With the increasing global stock of vehicles, traffic congestion is becoming more severe and costly in many urban road networks. Road network modeling and optimization are essential tools in predicting traffic flow and reducing network congestion. Markov chains are remarkably capable in modeling complex, dynamic, and large-scale networks; Google’s PageRank algorithm is a living proof. In this a...
متن کاملEfficiency of Equilibria in Uniform Matroid Congestion Games
Network routing games, and more generally congestion games play a central role in algorithmic game theory, comparable to the role of the traveling salesman problem in combinatorial optimization. It is known that the price of anarchy is independent of the network topology for non-atomic congestion games. In other words, it is independent of the structure of the strategy spaces of the players, an...
متن کاملAlgorithmically Efficient Networks
In this paper, we are interested in identifying algorithmically efficient networks. That is, determine minimal structural properties of a network that are sufficient to design simple, distributed algorithms to operate a communication network efficiently. The key algorithmic tasks in a communication network pertain scheduling (physical layer) and congestion control (network layer). Recent exciti...
متن کاملApplication of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملAdaptive Management for Networked Systems
We present a design for policy-based performance management of SMS Systems. The design takes as input the operator’s performance goals, which are expressed as policies that can be adjusted at run-time. In our specific design, an SMS administrator can specify the maximum delay for a message and the maximum percentage of messages that can be postponed during periods of congestion. The system atte...
متن کامل